Enhancing Keyword Search over Relational Databases Using Ontologies
نویسندگان
چکیده
Keyword Search Over Relational Databases (KSORDB) provides an easy way for casual users to access relational databases using a set of keywords. Although much research has been done and several prototypes have been developed recently, most of this research implements exact (also called syntactic or keyword) match. So, if there is a vocabulary mismatch, the user cannot get an answer although the database may contain relevant data. In this paper we propose a system that overcomes this issue. Our system extends existing schema-free KSORDB systems with semantic match features. So, if there were no or very few answers, our system exploits domain ontology to progressively return related terms that can be used to retrieve more relevant answers to user.
منابع مشابه
Enhancing Keyword Search in Relational Databases Using Nearly Duplicate Records
The importance of supporting keyword searches on relations has been widely recognized. Different from the existing keyword search techniques on relations, this paper focuses on nearly duplicate records in relational databases due to abbreviation and typos. As a result, processing keyword searches with duplicate records involves many unique challenges. In this paper we discuss the motivation and...
متن کاملScalable Continual Top-k Keyword Search in Relational Databases
Keyword search in relational databases has been widely studied in recent years because it does not require users neither to master a certain structured query language nor to know the complex underlying database schemas. Most of existing methods focus on answering snapshot keyword queries in static databases. In practice, however, databases are updated frequently, and users may have long-term in...
متن کاملKeyword Search in External Memory Graph
Keyword search over relational and XML data has grown in popularity since the advent of Web search engines. Keyword search over relational data is significantly different from web search as the required information is often split across multiple tables as a result of normalization. The algorithms and techniques that are applied to databases, thus produce answer trees from the data graph as oppo...
متن کاملEfficient and Effective Aggregate Keyword Search on Relational Databases
Keyword search on relational databases is useful and popular for many users without technical background. Recently, aggregate keyword search on relational databases was proposed and has attracted interest. However, two important problems still remain. First, aggregate keyword search can be very costly on large relational databases, partly due to the lack of efficient indexes. Second, finding th...
متن کاملOn the Foundations of Data Interoperability and Semantic Search on the Web
Title of Document: ON THE FOUNDATIONS OF DATA INTEROPERABILITY AND SEMANTIC SEARCH ON THE WEB Hamid Haidarian Shahri, Doctor of Philosophy, 2011 Directed By: Professor Donald Perlis Department of Computer Science This dissertation studies the problem of facilitating semantic search across disparate ontologies that are developed by different organizations. There is tremendous potential in enabli...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013